Boundaries and random walks on finitely generated infinite groups
نویسنده
چکیده
We prove that almost every path of a random walk on a finitely generated non-amenable group converges in the compactification of the group introduced by W.J. Floyd. In fact, we consider the more general setting of ergodic cocycles of some semigroup of 1-Lipschitz maps of a complete metric space with a boundary constructed following Gromov. We obtain in addition that when the Floyd boundary of a finitely generated group is non-trivial, then it is in fact maximal in the sense that it can be identified with the Poisson boundary of the group with reasonable measures. The proof relies on work of V. Kaimanovich together with visibility properties of Floyd boundaries. We also prove a related statement about convergence of certain sequences of points, for example quasi-geodesic rays or orbits of 1-Lipschitz maps.
منابع مشابه
Sublinear deviation between geodesics and sample paths
We give a proof of the sublinear tracking property for sample paths of random walks on various groups acting on spaces with hyperbolic-like properties. As an application, we prove sublinear tracking in Teichmüller distance for random walks on mapping class groups, and on Cayley graphs of a large class of finitely generated groups.
متن کاملMartin Boundaries of Random Walks: Ends of Trees and Groups
Consider a transient random walk Xn on an infinite tree T whose nonzero transition probabilities are bounded below. Suppose that Xn is uniformly irreducible and has bounded step-length. (Alternatively, Xn can be regarded as a random walk on a graph whose metric is equivalent to the metric of T.) The Martin boundary of Xn is shown to coincide with the space fl of all ends of T (or, equivalently,...
متن کاملAlgebraically recurrent random walks on groups
Initial steps are presented towards understanding which finitely generated groups are almost surely generated as a semigroup by the path of a random walk on the group.
متن کاملOn trivial ends of Cayley graph of groups
In this paper, first we introduce the end of locally finite graphs as an equivalence class of infinite paths in the graph. Then we mention the ends of finitely generated groups using the Cayley graph. It was proved that the number of ends of groups are not depended on the Cayley graph and that the number of ends in the groups is equal to zero, one, two, or infinity. For ...
متن کاملGeneric-case Complexity, Decision Problems in Group Theory and Random Walks
We give a precise definition of “generic-case complexity” and show that for a very large class of finitely generated groups the classical decision problems of group theory the word, conjugacy and membership problems all have linear-time generic-case complexity. We prove such theorems by using the theory of random walks on regular
متن کامل